Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
31	Parallel Breadth First Search on GPU Clusters Zhisong Fu SYSTAP, LLC Harish Kumar Dasari Add to Reading List Source URL: www.blazegraph.com Language: English - Date: 2015-02-12 16:09:50 Line graph Breadth-first search Graph Tree Degree Connectivity Edge coloring Path decomposition Graph theory Mathematics Theoretical computer science
32	CluE: An Algorithm for Expanding Clustered Graphs Ragaad AlTarawneh∗ Johannes Schultz† Shah Rukh Humayoun‡ Add to Reading List Source URL: www-hagen.cs.uni-kl.de Language: English - Date: 2014-04-02 06:01:29 Topological graph theory Tree Force-based algorithms Directed acyclic graph Planar graph Scene graph Path decomposition Graph theory Graph drawing Geometric graph theory
33	Property Testing and Its Connection to Learning and Approximation ODED GOLDREICH Weizmann Institute of Science, Rehovot, Israel SHAFI GOLDWASSER Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2003-04-11 14:47:48 Graph coloring Aanderaa–Karp–Rosenberg conjecture Property testing Planar graph Clique Graph property Path decomposition Line graph Graph theory Mathematics Theoretical computer science
34	The Visibility Region of Points in a Simple Polygon Otfried Cheong Ren´e van Oostrum Hong Kong University of Science and Technology Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:02:14 Polytopes Art gallery problem Computational geometry Simple polygon Polyhedra Complex polytope Path decomposition Geometry Mathematics Polygons
35	Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-03-19 09:17:44 NP-complete problems Interval graph Vertex cover Graph coloring Matching Independent set Dominating set Path decomposition Graph theory Theoretical computer science Mathematics
36	Mode Directed Path Finding Irene M. Ong1 , Inˆes de Castro Dutra2 , David Page1, V´ıtor Santos Costa2 1 2 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-07-20 15:45:54 Game artificial intelligence Constraint programming Network theory Shortest path problem Static single assignment form Hypergraph Pathfinding NP-complete problems Decomposition method Theoretical computer science Mathematics Graph theory
37	1 Application of computational geometry to network p-center location problems Binay Bhattacharya Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 23:59:59 Dynamic programming Vehicle Identification Number Tree Graph Path decomposition Graph theory Mathematics Tree decomposition
38	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
39	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
40	Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:57:54 Inequalities Minor Cubic graph Neighbourhood Planar graph Graph Path decomposition Petersen graph Graph theory Topological graph theory Crossing number